COMMENT ⊗   VALID 00012 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	READIN
C00003 00003	WRITIN
C00004 00004	PROVIN
C00005 00005	IMPURE
C00006 00006	MACHIN
C00007 00007	SEARCH
C00010 00008	EXTEND
C00011 00009	COMPIL
C00012 00010	COMPUT
C00013 00011	PATTER
C00014 00012	CONTRO
C00015 ENDMK
C⊗;
;;;READIN

EVALL.LSP[206,LSP] simple  eval plus defn of alist that should allow eval to 
	eval itself needs debugging
DIFF.LSP[206,CLT]  symbolic algebraic expression differentiation
;;;WRITIN

ACK.LSP[206,CLT] S-expression version of ackerman fn
	currently commented out of WRITIN as not proved non prim-rec
;;;PROVIN

PARTIT.LSP[206,LSP] partition and friends
	
SAMEFR.LSP[206,LSP] several versions of samefringe and cons counts


;;;IMPURE

IMPUR.LSP[206,LSP]  rplac and reentrant list structure examples

ARRAY[206,CLT] jmc a and c functions for arrays

;;;MACHIN

READ.LSP[206,LSP] prindot, prinlis, and read functions

EDITOR.LSP[206,LSP] LISP function editor

TRACE.LSP[206,LSP] LISP function trace package

;;;SEARCH

SEARCH.LSP[206,LSP] Depth first general tree search functions
	(SEARCH SEARCHLIS ALLSOL1 ALLSOL ALLSOLA ALLSOLB)

GRAPH.LSP[206,LSP] Characterization of a graph via TER,LOSE,SUCCESSORS
	(LOSE TER SUCCESSORS)

INSANI.LSP[206,LSP] Characterization of instant insanity puzzle 
     FNS:(LOSE TER SUCCESSORS ORLIS NTH CYCLES UPTO SUBLIS) 
     CONSTANTS: (P0 PUZZ1 PUZZ2 PUZZ3 PUZZ4 PUZZ4A PUZZ )
     ANSWERS: (SEARCH P0) (ALLSOL P0)
INSANB.LSP[206,LSP] Characterization of instant insanity puzzle (boolean version)
     FNS:(POO ZAP LOSE TER MAPCHOOSE SUCCESSORS)
     CONSTANTS: (P00 PUZZA)
     ANSWERS: (SEARCH P00) (ALLSOL P00)


GAME.LSP[206,LSP] 
    αβ-MINMAX gametree searching functions:
    (VALMAX VALMIN LINEMAX LINEMIN TREEMAX TREEMIN RECTIFY COMMONTAIL COMMONHEAD)
TICTAC.LSP[206,LSP]
    Functions characterizing the game of tictactoe in 2-d
    (COMMENCE EXT NEWGAME TER IMVAL SUCCESSORS REVERT UPDATE SORT SORTA SORTB SORTC
       WIN ANSWER DOUBLETH TWOLIS THREAT  ORLIS DELETE)

;;extra related files
TICTAC.SUP[206,LSP]
    Top level supervisor for playing ttt with computer using GAME.LSP and TICTAC.LSP
    (TICTAC ASK RAND CHOOSEMOVE PRINTBOARD! PRINTBOARD WINNER MEMARRAY VMX LMX TMX)

TICTAC[206,CLT] loads all the necessary files in order to play
GAME.WRU[206,JMC] has a brief explanation of the functions in GAME.LSP[206,LSP]
GAME.JMC[206,LSP] has old versions of GAME.LSP functions 
	(all take successors as argument rather than position)
TIC3D.LSP[206,JMC] beginning of 3d version
TIC3D.DAT[206,JMC]


;;;Not in book yet
BREADT.LSP[206,LSP] Breadth first search algorithm
CSGREC.LSP[206,LSP] Using BREAD fns to write a context sensitive grammar recognizer

;;;need graph example
;;;EXTEND

FLAT.LSP[206,LSP] derived fns for flat and fringe

;;;not incorporated yet  need to make one good version

CLEAN2[206,CLT]   purifying programs
CLEAN1.LSP[206,CLT]  "        "

;;;COMPIL

LCOM0.IL[206,LSP]  ILISP versions of LISP compilers
LCOM4.IL[206,LSP]

LCOM0.LSP[206,LSP]  MACLISP versions of LISP compilers
LCOM4.LSP[206,LSP]

SCOM0.LSP[206,LSP]  LCOM0.LSP modified to produce lists as labels rather
	than using GENSYM
;;;COMPUT

NEVAL.LSP[206,LSP] call by name evaluation (with out catching of bound variables).
;;;PATTER

PATTER.LSP[206,LSP]  pattern matching and unification programs.

TRANSF.LSP[206,LSP] jmc transformation fns and examples

SIMPL.LSP[206,LSP] clt simplification rule interp and rule for a LISP eval

;;;CONTRO

SCHEME.EX[206,CLT]   640 25-Jul-78 1443 000   1CLT E      25-Jul-78 09-Aug-78 P1185>
CONTIN[206,CLT]

TEVAL[206,CLT] teval traces fn calls  tleval traces go/call
TAIL[206,CLT] transforms fn into function the returns the trace as if
     evalled tail-recursively